NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
661	ENUMERATING 9 x 9 SUDOKU GRIDS Shi Fangying 1, Zhang Mengshi 1 and Helmer Aslaksen 2 1 2 Add to Reading List Source URL: www.math.nus.edu.sg Language: English - Date: 2008-09-17 23:49:22 Logic puzzles Latin squares NP-complete problems Mathematics of Sudoku Grid plan Matrix Sudoku algorithms Mathematics Recreational mathematics Sudoku
662	Evaluation of ILP-based Approaches for Partitioning into Colorful Components Sharon Bruckner1? , Falk H¨ uffner2?? , Christian Komusiewicz2 , and Rolf Niedermeier2 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-03-13 14:59:55 NP-complete problems Graph partition Clique Graph coloring Vertex Connected component Breadth-first search Connectivity Tree Graph theory Theoretical computer science Mathematics
663	The Parameterized Complexity of the Rainbow Subgraph Problem Falk Hüffner? , Christian Komusiewicz?? , Rolf Niedermeier, and Martin Rötzschke Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, German Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-07-31 12:35:33 NP-complete problems Graph coloring Degeneracy Vertex cover Edge coloring Clique Vertex Graph Dense subgraph Graph theory Theoretical computer science Mathematics
664	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-06-19 10:42:56 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Parameterized complexity NP-complete P versus NP problem NP FO Theoretical computer science Computational complexity theory Applied mathematics
665	Mungo’s Crossword N024 Add to Reading List Source URL: www.echo.net.au Language: English - Date: 2014-06-22 20:50:09 Saintpaulia Human behavior NP-complete problems Crosswords Cryptic crossword
666	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics
667	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
668	The Phase Transition in Exact Cover Vamsi Kalapala∗ and Cristopher Moore∗,† {vamsi,moore}@cs.unm.edu, ∗ Department of Computer Science, University of New Mexico Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-10-23 11:39:06 Automated theorem proving NP-complete problems Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Resolution Unit propagation Constraint satisfaction Theoretical computer science Mathematics Applied mathematics
669	W h e r e t h e Really H a r d P r o b l e m s A r e Peter Cheeseman Bob Kanefsky W i l l i a m M . Taylor Add to Reading List Source URL: www.dcs.gla.ac.uk Language: English - Date: 2009-10-23 06:18:38 Complexity classes NP-complete problems Mathematical optimization Graph theory Graph coloring NP-complete Connectivity 2-satisfiability NP Theoretical computer science Computational complexity theory Mathematics
670	Unique Games on the Hypercube Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2015-02-07 14:10:22 NP-complete problems Combinatorial optimization Linear programming Operations research Real algebraic geometry Semidefinite programming Maximum cut Vertex cover Hypercube graph Theoretical computer science Graph theory Mathematics

UPDATE